Exploring Real Mobility Data with M%2DAtlas.

Advanced knowledge discovery on movement data with the GeoPKDD system.

Spatio%2Dtemporal clustering.
the NSF or the U.S. government.
Anonymization of moving objects databases by clustering and perturbation.

Mining Mobility Behavior from Trajectory Data.

Trajectory pattern analysis for urban traffic.

K%2DBestMatch Reconstruction and Comparison of Trajectory Data.

Temporal mining for interactive workflow data analysis.

A Visual Analytics Toolkit for Cluster%2DBased Classification of Mobility Data.

Never Walk Alone Uncertainty for Anonymity in Moving Objects Databases.
Abstract — Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such that each individual is indistinguishable from at least k −1 other individuals. In this paper we study the problem of anonymity preserving data publishing in moving objects databases. We propose a novel concept of k-anonymity based on co-localization that exploits the inherent uncertainty of the moving object’s whereabouts. Due to sampling and positioning systems (e.g., GPS) imprecision, the trajectory of a moving object is no longer a polyline in a three-dimensional space, instead it is a cylindrical volume, where its radius δ represents the possible location imprecision: we know that the trajectory of the moving object is within this cylinder, but we do not know exactly where. If another object moves within the same cylinder they are indistinguishable from each other. This leads to the definition of (k, δ)-anonymity for moving objects databases. We first characterize the (k, δ)-anonymity problem and discuss techniques to solve it. Then we focus on the most promising technique by the point of view of information preservation, namely space translation. We develop a suitable measure of the information distortion introduced by space translation, and we prove that the problem of achieving (k, δ)-anonymity by space translation with minimum distortion is NP-hard. Faced with the hardness of our problem we propose a greedy algorithm based on clustering and enhanced with ad hoc pre-processing and outlier removal techniques. The resulting method, named N WA (N ever Walk Alone), is empirically evaluated in terms of data quality and efficiency. Data quality is assessed both by means of objective measures of information distortion, and by comparing the results of the same spatio-temporal range queries executed on the original database and on the (k, δ)-anonymized one. Experimental results show that for a wide range of values of δ and k, the relative error introduced is kept low, confirming that N WA produces high quality (k, δ)-anonymized data.
Temporal analysis of process logs a case study.

Spatiotemporal Data Mining.
With some significant exceptions, current applications for data mining are either in those areas for which there is little accepted discovery methodology or are being used within a knowledge discovery process that does not expect authoritative results but finds the discovered rules useful none-the-less. This is in contrast to its application in the fields applicable to spatial or spatio-temporal discovery which possess a
Visually driven analysis of movement data by progressive clustering.

Trajectory pattern mining.
The constant increase of moving object data imposes the need for modeling, processing, and mining trajectories, in order to find and understand the patterns behind these data. Existing works have mainly focused on the geometric properties of trajectories, while the semantics and the background geographic information has rarely been addressed. We claim that meaningful patterns can only be extracted from trajectories if the geographic space where trajectories are located is considered. In this paper we propose a reverse engineering framework for mining and modeling semantic trajectory patterns. Since trajectory patterns are data dependent, they may not be modeled in conceptual geographic database schemas before they are known. Therefore, we apply data mining to extract general trajectory patterns, and through a new kind of relationships, we model these patterns in the geographic database schema. A case study shows the power of the framework for modeling semantic trajectory patterns in the geographic space.
Extracting Trees of Quantitative Serial Episodes.

Mining sequences with temporal annotations.
In this paper we propose an extension of the sequence mining paradigm to (temporally-)annotated sequential patterns, where each transition in a sequential pattern is annotated with a typical transition time derived from the source data. Then, we present a basic solution for the novel mining problem based on the combination of sequential pattern mining and clustering, and assess this solution on two realistic datasets, illustrating how potentially useful patterns of the new form are extracted. 1.
Efficient Mining of Temporally Annotated Sequences.

Time%2Dfocused clustering of trajectories of moving objects.

Speeding%2DUp Hierarchical Agglomerative Clustering in Presence of Expensive Metrics.
Abstract. In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets which can be handled. In some contexts, in particular, computing distances between objects is the most expensive task. In this paper we propose a pruning heuristics aimed at improving performances in these cases, which is well integrated in all the phases of the HAC process and can be applied to two HAC variants: single-linkage and complete-linkage. After describing the method, we provide some theoretical evidence of its pruning power, followed by an empirical study of its effectiveness over different data domains, with a special focus on dimensionality issues. 1
Discovery of ads web hosts through traffic data analysis.

Deductive and Inductive Reasoning on Spatio%2DTemporal Data.

Deductive and Inductive Reasoning on Trajectories.

WebCat Automatic Categorization of Web Search Results.

Distances for Spatio%2DTemporal Clustering.

Data Mining for Intelligent Web Caching.
The paper presents a vertical application of data warehousing and data mining technology:  intelligent web caching. We introduce several ways to construct intelligent web  caching algorithms that employ predictive models of web requests; the general idea is to  extend the LRU policy of web and proxy servers by making it sensible to web access models  extracted from web log data using data mining techniques. Two approaches have been  studied in particular, one based on association rules and another based on decision trees.
Web log data warehousing and mining for intelligent web caching.
We introduce intelligent web caching algorithms that employ predictive models of web requests; the general idea is to extend the LRU policy of web and proxy servers by making it sensible to web access models extracted from web log data using data mining techniques. Two approaches have been studied in particular, frequent patterns and decision trees. The experimental results of the new algorithms show substantial improvement over existing LRU-based caching techniques, in terms of hit rate. We designed and developed a prototypical system, which supports data warehousing of web log data, extraction of data mining models and simulation of the web caching algorithms.
Nondeterministic%2C Nonmonotonic Logic Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its flexibility in expressing queries concerning aggregates and data cube. Also, we show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ programs, and supporting their efficient execution. Finally, we provide a more concrete implementation strategy, on which basis the design of optimization techniques tailored for Datalog++ is addressed.
Logic%2DBased Knowledge Discovery in Databases.
this paper, are extensively studied in [2, 4, 5, 10]
Probabilistic agent programs.
Agents are small programs that autonomously take actions based on changes... In this paper, we propose the concept of a probabilistic agent program and show how, given an arbitrary program written in any imperative language, we may build a declarative &#034;probabilistic&#034; agent program on top of it which supports decision making in the presence of uncertainty. We provide two alternative semantics for probabilistic agent programs. We show that the second semantics, though more epistemically appealing, is more complex to compute. We provide sound and complete algorithms to compute the semantics of positive agent programs.
Foundations of distributed interaction systems.

Integration of Deduction and Induction for Mining Supermarket Sales Data.

Probabilistic Agent Programs
Agents are small programs that autonomously take actions based on changes... In this paper, we propose the concept of a probabilistic agent program and show how, given an arbitrary program written in any imperative language, we may build a declarative &#034;probabilistic&#034; agent program on top of it which supports decision making in the presence of uncertainty. We provide two alternative semantics for probabilistic agent programs. We show that the second semantics, though more epistemically appealing, is more complex to compute. We provide sound and complete algorithms to compute the semantics of positive agent programs.
On the Effective Semantics of Nondeterministic
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. On this basis, the design of appropriate optimization techniques for Datalog++ is also discussed.
Query Answering in Nondeterministic%2C Nonmonotonic Logic Databases.

Datalog   A Basis for Active Object%2DOriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
Datalog   A Basis for Active Object%2DOriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
Datalog   a Basis for Active Object.Oriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
